Best Fitting Rectangles
نویسندگان
چکیده
We solve an interesting optimization problem motivated by tolerancing metrology, paper position sensing, and facility location: What rectangle fits best a given set of points? This problem has relations to the minimum width annulus problem and also to the largest empty rectangle problem for both of which O(n log n) time solutions are not known. Nevertheless, for our problem there is a linear time algorithm for arbitrary axis-parallel rectangles and a O(n log n) solution if the aspect ratio of the rectangles is prescribed.
منابع مشابه
A new efficient algorithm for fitting of rectangles and squares
In this paper, we introduce a completely new approach to fitting rectangles and squares to given closed regions using our published ideas in [6], [7], [8]. In these papers, we have developed a new region-based fitting method using the method of normalization. There we demonstrate the zero-parametric fitting of lines, triangles, parallelograms, circles and ellipses, and the one-parametric fittin...
متن کاملBuilding detection from high-resolution PolSAR data at the rectangle level by combining region and edge information
We propose a new approach at the rectangle feature level to extract buildings from high-resolution polarimetric synthetic aperture radar (PolSAR) data, using both region-based and edge-based information. The first step employs low-level detectors to provide raw region and edge information of the scene. In the second step, the rectangle features are initially extracted from the edge detection re...
متن کاملBidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing
The two dimensional orthogonal rectangular strip packing problem is a common NPhard optimisation problem whereby a set of rectangular shapes must be placed on a fixed width stock sheet with infinite length in such a way that wastage is minimised and material utilisation is maximised. The bidirectional best-fit heuristic is a deterministic approach which has previously been shown to outperform e...
متن کاملMaximum independent set of rectangles
We study the Maximum Independent Set of Rectangles (MISR) problem: given a collection R of n axis-parallel rectangles, find a maximum-cardinality subset of disjoint rectangles. MISR is a special case of the classical Maximum Independent Set problem, where the input is restricted to intersection graphs of axis-parallel rectangles. Due to its many applications, ranging from map labeling to data m...
متن کاملThe best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
We investigate the best-fit heuristic algorithm by Burke et al. [Operations Research 52 (2004) 655–671] for the rectangular strip packing problem. For its simplicity and good performance, the best-fit heuristic has become one of the most significant algorithms for the rectangular strip packing. In this paper, we propose an efficient implementation of the best-fit heuristic that requires linear ...
متن کامل